Representing cellular automata using Specification and Description Language

نویسندگان

  • Pau Fonseca i Casas
  • Màxim Colls
  • Josep Casanovas
چکیده

In this paper we show how to use Specification and Description Language (SDL) to represent cellular automata models. To achieve that we use a generalization of the common cellular automata, named m:n-CA, allowing the definition of multiple layers in a single cellular automata. Also we add some extension to SDL language to simplify the representation of these automata. Thanks SDL and m:n-CA the behavior of the cellular automata model can be defined in a graphical way allowing the complete and unambiguous description of the simulation model that uses it. SDL is a modern object oriented formalism that allows the definition of distributed systems. It has focused on the modeling of reactive, state/event driven systems, and has been standardized by the International Telecommunications Union (ITU) in the Z.100. In our approximation the SDL representation of the model (a Microsoft Visio® diagram) can be executed. This implies that since is not needed to perform any implementation, the verification process is simplified.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Representing Fibonacci function through cellular automata using Specification and Description Language

In this poster we show how to use Specification and Description Language (SDL) to represent cellular automata models. To achieve that we use a generalization of the common cellular automata, named m:n-CA. Also we add some extension to SDL language to simplify the representation of these automata. Thanks to SDL and m:n-CA the behavior of the cellular automata model can be defined in a graphical ...

متن کامل

Robot Path Planning Using Cellular Automata and Genetic Algorithm

In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...

متن کامل

Web Service Choreography Verification Using Z Formal Specification

Web Service Choreography Description Language (WS-CDL) describes and orchestrates the services interactions among multiple participants. WS-CDL verification is essential since the interactions would lead to mismatches. Existing works verify the messages ordering, the flow of messages, and the expected results from collaborations. In this paper, we present a Z specification of WS-CDL. Besides ve...

متن کامل

Improved Frog Leaping Algorithm Using Cellular Learning Automata

In this paper, a new algorithm which is the result of the combination of cellular learning automata and frog leap algorithm (SFLA) is proposed for optimization in continuous, static environments.At the proposed algorithm, each memeplex of frogs is placed in a cell of cellular learning automata. Learning automata in each cell acts as the brain of memeplex, and will determine the strategy of moti...

متن کامل

Design and Implementation of Area Efficient Cellular Automata for Efficient Cryptography

A novel cryptographic algorithm mainly depends on the cellular automata .In order to get the randomness using cellular automata concept. In this algorithm we have mainly concentrated on cellular automata module we have 8 different rules for different rounds .In previous algorithm the message and key size was 128bit, but in this project to eliminate all the unnecessary logic operations present i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010